Semantics of 'deep' grammars - its applicability and evaluation
نویسندگان
چکیده
Presenting advances in semantic specification using Minimal Recursion Semantics embedded in an HPSG grammar, the paper addresses the question how the semantic performance of such grammars can be evaluated. We suggest that if a grammar can contribute to correct steering of an artificial agent in a text-based instruction application, then this is as close as one can get to a correctness criterion. However, this is a type of situation we can still only imagine in this paper, we show examples of semantic representations which stand a chance of providing the explicitness required in a steering scenario, and comment on the prospect of more systematically, and with more coverage, producing such representations using the type of grammar in question.
منابع مشابه
The role of Persian causative markers in the acquisition of English causative verbs
This project investigates the relationship between lexical semantics and causative morphology in the acquisition of causative/inchoative-related verbs in English as a foreign language by Iranian speakers. Results of translation and picture judgment task show although L2 learners have largely acquired the correct lexico-syntactic classification of verbs in English, they were constrained by ...
متن کاملWord Sense Disambiguation and Semantic Disambiguation for Construction Types in Deep Processing Grammars
The paper presents advances in the use of semantic features and interlingua relations for word sense disambiguation (WSD) as part of unification-based deep processing grammars. Formally we present an extension of Minimal Recursion Semantics, introducing sortal specifications as well as linterlingua semantic relations as a means of semantic decomposition.
متن کاملConstraint-based RMRS Construction from Shallow Grammars
Semantic formalisms such as MRS [Copestake et al., 2003], UDRT [Reyle, 1993], or CLLS [Egg et al., 2001] provide elegant solutions for the treatment of semantic ambiguities in terms of underspecification. These semantic formalisms are not constrained to specific syntactic frameworks. MRS, for example, is mainly used with HPSG grammars, but may also be built from LFG grammars using co-descriptio...
متن کاملAn Empirical Evaluation of Probabilistic Lexicalized Tree Insertion Grammars
We present an empirical study of the applicability of Probabilistic Lexicalized Tree Insertion Grammars (PLTIG), a lexicalized counterpart to Probabilistic Context-Free Grammars (PCFG), to problems in stochastic naturallanguage processing. Comparing the performance of PLTIGs with non-hierarchicalN -gram models and PCFGs, we show that PLTIG combines the best aspects of both, with language modeli...
متن کاملSemantics, Representations and Grammars for Deep Learning
Deep learning is currently the subject of intensive study. However, fundamental concepts such as representations are not formally defined – researchers “know them when they see them” – and there is no common language for describing and analyzing algorithms. This essay proposes an abstract framework that identifies the essential features of current practice and may provide a foundation for futur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007